Theory of computation - PDFSEARCH.IO - Document Search Engine

Theory of computation
Results: 2087

#	Item
71	Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves ´ Alin Bostan1 , Pierrick Gaudry2 , Eric Schost3 Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2003-09-22 06:40:39 Algebra Mathematics Polynomials Multiplication Matrix theory Linear algebra Polynomial Matrix NC Characteristic polynomial Multiplication algorithm Polynomial greatest common divisor
72	Wang Tiles May 2, 2006 Abstract Suppose we want to cover the plane with decorated square tiles of the same size. Tiles are to be chosen from a finite number of types. There are unbounded tiles of each type available. Due Add to Reading List Source URL: www.staff.science.uu.nl Language: English - Date: 2011-12-30 16:37:17 Aperiodic tilings Geometry Mathematics Mosaic Visual arts Tessellation Theory of computation Wang tile Tile Penrose tiling Aperiodic set of prototiles
73	COGNITIVE SCIENCE Vol, pp. 157–205 Copyright © 1999 Cognitive Science Society, Inc. ISSNAll rights of reproduction in any form reserved. Add to Reading List Source URL: cnl.psych.cornell.edu Language: English - Date: 2006-10-09 12:19:23 Cognitive science Cognition Academia Recursion Theory of computation Computability theory Generative linguistics Noam Chomsky Transformational grammar Language acquisition Connectionism Linguistic competence
74	CS264: Beyond Worst-Case Analysis The Top 10 List∗ Tim Roughgarden† December 3, 2014 We covered a lot of concepts in this course. To appreciate this, let’s review the overarching narrative of the course via a top 1 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 18:09:21 Computational complexity theory Theory of computation Mathematics Analysis of algorithms Operations research Mathematical optimization NP-complete problems Smoothed analysis Algorithm Competitive analysis Best worst and average case Time complexity
75	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-06-04 08:45:27 Mathematics NP-complete problems Theory of computation Scheduling Theoretical computer science Combinatorial optimization Independent set Makespan Approximation algorithm Matching Operations research Truthful job scheduling
76	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:43:49 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Operations research Asymptotic analysis Combinatorial optimization Dynamic programming Master theorem Big O notation Knapsack problem Time complexity
77	Types and Type-Free λ-Calculus Dana S. Scott, FBA, FNAS University Professor Emeritus Carnegie Mellon University Visiting Scholar Add to Reading List Source URL: www1.maths.leeds.ac.uk Language: English - Date: 2016-06-16 11:50:12 Computability theory Theoretical computer science Mathematical logic Theory of computation Models of computation Formal methods Logic in computer science Lambda calculus Recursively enumerable set -recursive function Denotational semantics Numbering
78	2 Complexity in the Universe Charles H. Bennett IBM Research Division, T . J. Watson Research Center Yorktown Heights, NYUSA. Add to Reading List Source URL: cqi.inf.usi.ch Language: English - Date: 2014-02-18 12:20:16 Information theory Theoretical computer science Randomness Metaphysics Knowledge Algorithmic information theory Thermodynamic entropy Theory of computation Complexity Kolmogorov complexity Algorithmic probability Entropy
79	MCS 441 – Theory of Computation I Spring 2016 Problem Set 4 Lev Reyzin Due: at the beginning of class Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-03-11 11:17:16 Theoretical computer science Turing machine Theory of computation Computability theory Computer science Alan Turing Models of computation Machine that always halts Computability NP
80	In: Partial Evaluation, International Seminar, Dagstuhl Castle, Germany, February 1996, Lecture Notes in Computer Science 1110, Springer, 1996 ppInvited paper) A Comparative Revisitation of Some Program Tran Add to Reading List Source URL: repository.readscheme.org Language: English - Date: 2010-10-22 08:04:37 Software engineering Computer programming Software development Programming idioms Computability theory Functional programming Theoretical computer science Logic programming Unfolding Recursion Free variables and bound variables Symbolic computation

UPDATE